Non-approximability of precedence-constrained sequencing to minimize setups
نویسندگان
چکیده
منابع مشابه
Non-approximability of precedence-constrained sequencing to minimize setups
It is a basic scheduling problem to sequence a set of precedence-constrained tasks to minimize the number of setups, where the tasks are partitioned into classes that require the same setup. We prove a conjecture in (Ph.D. Thesis, School of ISyE, Georgia Institute of Technology, August 1986; Oper. Res. 39 (1991) 1012) that no polynomial-time algorithm for this problem has constant worst-case pe...
متن کاملApproximability of Precedence Constrained and Robust Scheduling Problems
This thesis studies the approximability of scheduling problems in different contexts. Chapter 2 gives a short introduction to the field of scheduling theory and presents a simple single machine scheduling problem that will form the base for all variants considered in the remainder of this thesis. We point out that this scheduling problem, though long known to be efficiently solvable in its orig...
متن کاملA note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [Non-approximability of precedence-constrained sequencing to minimize setups, DiscreteAppl. Math. 134:351–360, 2004] on the inapproximability of a scheduling problem known as precedence-constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves up...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملSequencing to Minimize the Total Weighted Completion Times Subject to Resources and Arbitrary Precedence
We present an anlgorithm for minimizing the sum of the weighted completion times of n jobs that are subject to arbitrary precedence, when each job may require the simultaneous occupancy of a subset of m resources.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.08.006